Search results for "Broyden–Fletcher–Goldfarb–Shanno algorithm"
showing 2 items of 2 documents
Hidden Markov random field model and Broyden–Fletcher–Goldfarb–Shanno algorithm for brain image segmentation
2018
International audience; Many routine medical examinations produce images of patients suffering from various pathologies. With the huge number of medical images, the manual analysis and interpretation became a tedious task. Thus, automatic image segmentation became essential for diagnosis assistance. Segmentation consists in dividing the image into homogeneous and significant regions. We focus on hidden Markov random fields referred to as HMRF to model the problem of segmentation. This modelisation leads to a classical function minimisation problem. Broyden-Fletcher-Goldfarb-Shanno algorithm referred to as BFGS is one of the most powerful methods to solve unconstrained optimisation problem. …
Hidden Markov Random Field model and BFGS algorithm for Brain Image Segmentation
2016
Brain MR images segmentation has attracted a particular focus in medical imaging. The automatic image analysis and interpretation became a necessity. Segmentation is one of the key operations to provide a crucial decision support to physicians. Its goal is to simplify the representation of an image into items meaningful and easier to analyze. Hidden Markov Random Fields (HMRF) provide an elegant way to model the segmentation problem. This model leads to the minimization problem of a function. BFGS (Broyden-Fletcher-Goldfarb-Shanno algorithm) is one of the most powerful methods to solve unconstrained optimization problem. This paper presents how we combine HMRF and BFGS to achieve a good seg…